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 20, 2026 19:26Victor MerckléVictor MerckléScore: 14,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:2714,276128,227,380112,692,0005,807,0002,117,632stderr
2May 20, 2026 19:2714,290128,674,485112,829,0005,780,0002,117,632stderr
3May 20, 2026 19:2714,323128,494,846112,914,0005,970,0002,117,632stderr
4May 20, 2026 19:2714,334128,407,471113,080,0005,900,0002,117,632stderr
5May 20, 2026 19:2714,350128,509,654113,402,0005,705,0002,117,632stderr
6May 20, 2026 19:2714,373128,931,205112,961,0006,340,0002,117,632stderr
7May 20, 2026 19:2714,378128,089,439113,276,0006,062,0002,117,632stderr
8May 20, 2026 19:2714,396131,198,385113,075,0006,420,0002,117,632stderr
9May 20, 2026 19:2714,442140,859,679113,584,0006,285,0002,117,632stderr