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 10, 2026 10:35wnwnScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:363,40643,120,02427,240,0001,030,0002,486,272
2May 10, 2026 10:363,43945,737,02327,454,0001,094,0002,490,368
3May 10, 2026 10:363,51644,450,36328,083,0001,105,0002,482,176
4May 10, 2026 10:363,55842,170,60828,485,0001,052,0002,486,272
5May 10, 2026 10:363,55944,962,66028,484,0001,056,0002,482,176
6May 10, 2026 10:363,57343,976,45228,583,0001,081,0002,482,176
7May 10, 2026 10:363,58943,145,89728,697,0001,096,0002,498,560
8May 10, 2026 10:363,59144,462,94228,692,0001,120,0002,486,272
9May 10, 2026 10:363,59347,075,24228,749,0001,079,0002,490,368