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 20:52Victor MerckléVictor MerckléScore: 7,727Success
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 20:537,71972,361,51463,035,0001,036,0002,117,632stderr
2May 13, 2026 20:537,72273,512,39163,036,0001,057,0002,117,632stderr
3May 13, 2026 20:537,72473,305,62962,978,0001,137,0002,117,632stderr
4May 13, 2026 20:537,72572,077,68963,010,0001,114,0002,117,632stderr
5May 13, 2026 20:537,72773,304,76763,013,0001,123,0002,117,632stderr
6May 13, 2026 20:537,73372,829,74663,037,0001,153,0002,117,632stderr
7May 13, 2026 20:537,73373,128,12863,157,0001,033,0002,117,632stderr
8May 13, 2026 20:537,73472,956,44263,070,0001,127,0002,117,632stderr
9May 13, 2026 20:537,73671,502,10963,061,0001,149,0002,117,632stderr