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 listFeb 3, 2026 10:31RuszrokRuszrokScore: 331,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 10:31331,7012,779,498,2822,753,117,00002,363,392
2Feb 3, 2026 10:31331,7992,781,435,9122,753,928,00002,285,568
3Feb 3, 2026 10:31331,8232,780,932,5862,753,133,000999,0002,285,568
4Feb 3, 2026 10:31331,8652,785,835,8302,752,484,0001,998,0002,289,664
5Feb 3, 2026 10:31331,8932,780,072,1922,752,712,0001,999,0002,285,568
6Feb 3, 2026 10:31332,0532,781,877,1262,756,043,00002,285,568
7Feb 3, 2026 10:31332,0942,781,916,4492,755,382,000999,0002,285,568
8Feb 3, 2026 10:31332,1262,784,847,0002,754,645,0001,999,0002,285,568
9Feb 3, 2026 10:31332,3562,782,490,4062,757,557,000999,0002,293,760