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 listMay 3, 2026 19:53TudyMTudyMScore: 34,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:5734,520305,233,513285,513,0001,007,0002,371,584
2May 3, 2026 19:5734,530303,065,096285,599,0001,006,0002,371,584
3May 3, 2026 19:5734,533301,820,489285,620,0001,006,0002,383,872
4May 3, 2026 19:5734,533304,034,173285,625,0001,004,0002,387,968
5May 3, 2026 19:5734,535306,021,549285,638,0001,007,0002,371,584
6May 3, 2026 19:5734,537305,395,928285,658,0001,005,0002,379,776
7May 3, 2026 19:5734,543301,067,399285,710,0001,004,0002,379,776
8May 3, 2026 19:5734,545301,277,602285,720,0001,004,0002,371,584
9May 3, 2026 19:5734,574303,251,276285,959,0001,006,0002,371,584