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 11, 2026 13:27wnwnScore: 4,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 13:274,22857,210,26233,086,0002,005,0002,277,376
2Apr 11, 2026 13:274,23755,980,14633,157,0002,009,0002,502,656
3Apr 11, 2026 13:274,25257,967,37334,287,0001,008,0002,490,368
4Apr 11, 2026 13:274,26658,004,04834,395,0001,011,0002,494,464
5Apr 11, 2026 13:274,27956,711,00734,504,0001,014,0002,498,560
6Apr 11, 2026 13:274,28763,676,18034,563,0001,016,0002,277,376
7Apr 11, 2026 13:274,31759,787,09433,843,0001,990,0002,531,328
8Apr 11, 2026 13:274,32063,606,73333,865,0001,992,0002,277,376
9Apr 11, 2026 13:274,51854,716,13836,489,0001,013,0002,535,424