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 28, 2026 19:22Victor MerckléVictor MerckléScore: 3,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:243,72440,009,43129,768,0001,143,0002,117,632stderr
2Aug 28, 2026 19:243,73239,165,12929,906,0001,076,0002,117,632stderr
3Aug 28, 2026 19:243,73239,059,94229,893,0001,088,0002,117,632stderr
4Aug 28, 2026 19:243,75139,297,50129,951,0001,188,0002,117,632stderr
5Aug 28, 2026 19:243,76339,495,26330,139,0001,102,0002,117,632stderr
6Aug 28, 2026 19:243,77639,485,34130,216,0001,128,0002,117,632stderr
7Aug 28, 2026 19:243,77639,533,05930,251,0001,091,0002,117,632stderr
8Aug 28, 2026 19:243,78739,599,85430,331,0001,109,0002,117,632stderr
9Aug 28, 2026 19:243,93040,765,51631,556,0001,070,0002,117,632stderr