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 listMay 13, 2026 18:43M-RochatM-RochatScore: 20,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:4319,897175,698,149164,109,0001,044,0002,113,536
2May 13, 2026 18:4319,929174,234,867164,387,0001,026,0002,113,536
3May 13, 2026 18:4319,936176,360,946164,451,0001,023,0002,113,536
4May 13, 2026 18:4319,999174,715,554164,981,0001,018,0002,113,536
5May 13, 2026 18:4320,037176,686,748165,211,0001,098,0002,113,536
6May 13, 2026 18:4320,056177,092,940165,450,0001,020,0002,113,536
7May 13, 2026 18:4320,078176,602,861165,628,0001,023,0002,113,536
8May 13, 2026 18:4320,126177,489,455166,014,0001,035,0002,113,536
9May 13, 2026 18:4320,544181,259,826169,487,0001,036,0002,113,536