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 13, 2026 18:45Victor MerckléVictor MerckléScore: 67,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:4667,137566,258,611556,107,0001,131,0002,117,632stderr
2May 13, 2026 18:4667,185567,117,953556,556,0001,085,0002,117,632stderr
3May 13, 2026 18:4667,210565,526,908556,787,0001,063,0002,117,632stderr
4May 13, 2026 18:4667,216566,778,309556,863,0001,033,0002,117,632stderr
5May 13, 2026 18:4667,227565,231,712556,847,0001,140,0002,117,632stderr
6May 13, 2026 18:4667,232567,275,118556,944,0001,086,0002,117,632stderr
7May 13, 2026 18:4667,240567,577,736557,092,0001,001,0002,117,632stderr
8May 13, 2026 18:4667,254567,282,268557,152,0001,064,0002,117,632stderr
9May 13, 2026 18:4667,262566,564,847557,175,0001,107,0002,117,632stderr