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 24, 2026 16:48spatialspatialScore: 84,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:4883,941724,545,821641,735,00054,977,0002,371,584
2Feb 24, 2026 16:4884,169724,982,535636,640,00061,965,0002,293,760
3Feb 24, 2026 16:4884,396731,254,304639,531,00060,955,0002,453,504