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 listJul 16, 2026 04:01Kevin HeaveyKevin HeaveyScore: 5,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 04:035,20452,879,04541,123,0002,072,0002,117,632
2Jul 16, 2026 04:035,40655,901,29742,869,0002,006,0002,117,632
3Jul 16, 2026 04:035,42454,704,63243,018,0002,008,0002,117,632
4Jul 16, 2026 04:035,45055,034,41743,111,0002,128,0002,117,632
5Jul 16, 2026 04:035,47955,169,55743,357,0002,124,0002,117,632
6Jul 16, 2026 04:035,52755,564,31343,816,0002,062,0002,117,632
7Jul 16, 2026 04:035,71257,131,48045,175,0002,240,0002,117,632
8Jul 16, 2026 04:035,85965,058,66146,517,0002,115,0002,117,632
9Jul 16, 2026 04:035,93358,947,10047,111,0002,139,0002,117,632