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 listApr 22, 2026 05:36wnwnScore: 3,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:373,54042,965,82828,376,0001,013,0002,486,272
2Apr 22, 2026 05:373,54845,223,11528,440,0001,015,0002,486,272
3Apr 22, 2026 05:373,59442,278,34827,844,0001,988,0002,482,176
4Apr 22, 2026 05:373,65745,833,64729,347,0001,011,0002,486,272
5Apr 22, 2026 05:373,66845,656,04129,431,0001,014,0002,502,656
6Apr 22, 2026 05:373,68043,230,67929,532,0001,018,0002,330,624
7Apr 22, 2026 05:373,74749,612,88329,101,0002,007,0002,482,176
8Apr 22, 2026 05:373,76243,213,37830,222,0001,007,0002,486,272
9Apr 22, 2026 05:373,76846,695,29031,275,00002,490,368