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 22, 2026 21:06wnwnScore: 4,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 21:074,37959,993,66635,334,0001,009,0002,277,376
2Feb 22, 2026 21:064,41563,707,05335,628,0001,017,0002,502,656
3Feb 22, 2026 21:064,43661,801,88634,830,0001,990,0002,277,376
4Feb 22, 2026 21:074,43866,974,53234,846,0001,991,0002,277,376
5Feb 22, 2026 21:064,43960,245,35235,845,000995,0002,502,656
6Feb 22, 2026 21:074,44459,096,09834,891,0001,993,0002,277,376