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 26, 2026 21:08Victor MerckléVictor MerckléScore: 7,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:097,32669,205,90759,693,0001,118,0002,117,632stderr
2Aug 26, 2026 21:097,33369,251,13459,790,0001,076,0002,117,632stderr
3Aug 26, 2026 21:097,35969,438,02859,995,0001,090,0002,117,632stderr
4Aug 26, 2026 21:097,43370,426,24260,599,0001,100,0002,117,632stderr
5Aug 26, 2026 21:097,44770,883,00760,723,0001,094,0002,117,632stderr
6Aug 26, 2026 21:097,45271,107,01860,768,0001,084,0002,117,632stderr
7Aug 26, 2026 21:097,47471,100,45661,025,0001,011,0002,117,632stderr
8Aug 26, 2026 21:097,49071,186,89761,075,0001,094,0002,117,632stderr
9Aug 26, 2026 21:097,49971,320,65961,155,0001,091,0002,117,632stderr