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 30, 2026 18:07Karthik ReddyKarthik ReddyScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:073,42137,413,82927,277,0001,120,0002,113,536
2Sep 30, 2026 18:073,42337,345,80127,319,0001,099,0002,113,536
3Sep 30, 2026 18:073,42437,331,44727,326,0001,100,0002,113,536
4Sep 30, 2026 18:073,42837,391,54627,351,0001,107,0002,113,536
5Sep 30, 2026 18:073,44637,480,79327,483,0001,127,0002,113,536
6Sep 30, 2026 18:073,45437,648,81327,491,0001,178,0002,113,536
7Sep 30, 2026 18:073,46237,626,00827,551,0001,185,0002,113,536
8Sep 30, 2026 18:073,47137,785,95827,623,0001,191,0002,113,536
9Sep 30, 2026 18:073,48037,649,81327,876,0001,014,0002,113,536