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 listMar 16, 2026 21:34zielajzielajScore: 3,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 21:353,48755,600,51726,945,0001,995,0002,519,040
2Mar 16, 2026 21:343,50051,972,68227,048,0002,003,0002,433,024
3Mar 16, 2026 21:353,50051,514,52627,051,0002,003,0002,519,040
4Mar 16, 2026 21:343,50753,149,35627,100,0002,007,0002,437,120
5Mar 16, 2026 21:343,51457,152,88726,153,0003,017,0002,433,024
6Mar 16, 2026 21:353,52249,950,81927,218,0002,016,0002,519,040