Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 27, 2026 06:54Karthik ReddyKarthik ReddyScore: 6,543Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 06:556,32562,970,45651,417,0001,081,0002,113,536
2Sep 27, 2026 06:556,32562,896,56451,409,0001,092,0002,113,536
3Sep 27, 2026 06:556,51664,597,78752,993,0001,095,0002,113,536
4Sep 27, 2026 06:556,52164,561,25353,035,0001,097,0002,113,536
5Sep 27, 2026 06:556,54364,786,52253,205,0001,106,0002,113,536
6Sep 27, 2026 06:556,55064,807,99853,263,0001,102,0002,113,536
7Sep 27, 2026 06:556,57064,971,91253,430,0001,108,0002,113,536
8Sep 27, 2026 06:556,57365,060,07553,447,0001,112,0002,113,536
9Sep 27, 2026 06:556,59865,235,43753,657,0001,110,0002,113,536