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 29, 2026 02:47Victor MerckléVictor MerckléScore: 3,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 02:473,67438,801,47829,339,0001,157,0002,117,632stderr
2Aug 29, 2026 02:473,69938,992,07129,622,0001,080,0002,117,632stderr
3Aug 29, 2026 02:473,70838,965,69229,667,0001,115,0002,117,632stderr
4Aug 29, 2026 02:473,71839,103,19529,765,0001,097,0002,117,632stderr
5Aug 29, 2026 02:473,72739,225,21429,864,0001,076,0002,117,632stderr
6Aug 29, 2026 02:473,73639,335,90629,940,0001,076,0002,117,632stderr
7Aug 29, 2026 02:473,76039,435,16430,127,0001,082,0002,117,632stderr
8Aug 29, 2026 02:473,91141,412,20531,398,0001,071,0002,117,632stderr
9Aug 29, 2026 02:473,91540,698,59031,433,0001,066,0002,117,632stderr