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 25, 2026 01:42Victor MerckléVictor MerckléScore: 8,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:438,10575,632,37566,132,0001,145,0002,117,632stderr
2Aug 25, 2026 01:438,12875,823,86466,372,0001,095,0002,117,632stderr
3Aug 25, 2026 01:438,13375,916,15766,428,0001,084,0002,117,632stderr
4Aug 25, 2026 01:438,14375,994,28366,504,0001,086,0002,117,632stderr
5Aug 25, 2026 01:438,15476,094,74666,593,0001,088,0002,117,632stderr
6Aug 25, 2026 01:438,17476,207,85566,757,0001,093,0002,117,632stderr
7Aug 25, 2026 01:438,17976,255,80266,811,0001,076,0002,117,632stderr
8Aug 25, 2026 01:438,26976,830,57367,468,0001,167,0002,117,632stderr
9Aug 25, 2026 01:438,45978,586,69969,135,0001,080,0002,117,632stderr