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 listAug 27, 2026 06:15Victor MerckléVictor MerckléScore: 4,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 06:164,45045,203,06635,770,0001,167,0002,117,632stderr
2Aug 27, 2026 06:164,47746,156,63735,995,0001,168,0002,117,632stderr
3Aug 27, 2026 06:164,47745,437,71836,018,0001,147,0002,117,632stderr
4Aug 27, 2026 06:164,50045,536,10236,265,0001,093,0002,117,632stderr
5Aug 27, 2026 06:164,50146,863,01936,261,0001,099,0002,117,632stderr
6Aug 27, 2026 06:164,51645,648,29836,387,0001,097,0002,117,632stderr
7Aug 27, 2026 06:164,55046,035,56836,623,0001,150,0002,117,632stderr
8Aug 27, 2026 06:164,59346,272,97337,073,0001,057,0002,117,632stderr
9Aug 27, 2026 06:164,60046,358,36437,110,0001,078,0002,117,632stderr