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 12, 2026 04:41olliecrowolliecrowScore: 6,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 04:416,00477,246,83147,840,0001,993,0002,285,568
2Feb 12, 2026 04:416,17787,179,99349,256,0002,010,0002,519,040
3Feb 12, 2026 04:416,21879,698,36850,599,0001,011,0002,441,216
4Feb 12, 2026 04:416,32878,267,91450,500,0002,020,0002,465,792
5Feb 12, 2026 04:416,38480,485,11749,986,0002,999,0002,404,352
6Feb 12, 2026 04:416,39178,531,83750,047,0003,002,0002,465,792