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 10, 2026 20:50wnwnScore: 4,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:504,44158,422,69434,867,0001,992,0002,273,280
2Mar 10, 2026 20:504,45560,163,85234,981,0001,998,0002,490,368
3Mar 10, 2026 20:504,48660,050,92535,219,0002,012,0002,478,080