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 4, 2026 21:12M-RochatM-RochatScore: 29,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:1229,282260,357,248242,036,0001,006,0002,473,984
2May 4, 2026 21:1229,300257,734,331242,188,0001,006,0002,465,792
3May 4, 2026 21:1229,426259,084,059243,234,0001,006,0002,453,504
4May 4, 2026 21:1229,557259,658,298244,325,0001,005,0002,469,888
5May 4, 2026 21:1229,862263,311,514246,852,0001,006,0002,465,792
6May 4, 2026 21:1229,880263,800,913246,998,0001,008,0002,473,984
7May 4, 2026 21:1229,929264,561,739247,407,0001,005,0002,465,792
8May 4, 2026 21:1229,953267,902,363247,612,0001,005,0002,473,984
9May 4, 2026 21:1229,982263,909,492247,820,0001,034,0002,461,696