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 18:55wnwnScore: 4,944Success
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 18:554,92368,287,60138,866,0001,993,0002,277,376
2Feb 22, 2026 18:554,93060,166,72838,925,0001,996,0002,535,424
3Feb 22, 2026 18:554,93363,096,81838,950,0001,997,0002,531,328
4Feb 22, 2026 18:554,93962,445,38338,993,0001,999,0002,494,464
5Feb 22, 2026 18:554,94467,314,72039,032,0002,001,0002,277,376
6Feb 22, 2026 18:554,95966,306,84539,149,0002,007,0002,486,272
7Feb 22, 2026 18:554,98962,493,63540,397,0001,009,0002,277,376
8Feb 22, 2026 18:555,00266,288,93240,508,0001,012,0002,494,464
9Feb 22, 2026 18:555,02269,300,51940,670,0001,016,0002,502,656