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 09:17Victor MerckléVictor MerckléScore: 5,024Success
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 09:194,88348,823,53039,449,0001,084,0002,117,632stderr
2Aug 29, 2026 09:194,88648,647,63439,479,0001,079,0002,117,632stderr
3Aug 29, 2026 09:194,88749,670,48039,450,0001,113,0002,117,632stderr
4Aug 29, 2026 09:195,00751,138,21740,482,0001,084,0002,117,632stderr
5Aug 29, 2026 09:195,02450,797,35640,612,0001,094,0002,117,632stderr
6Aug 29, 2026 09:195,03850,100,91040,813,0001,005,0002,117,632stderr
7Aug 29, 2026 09:195,04550,120,21640,786,0001,088,0002,117,632stderr
8Aug 29, 2026 09:195,09250,413,24741,179,0001,088,0002,117,632stderr
9Aug 29, 2026 09:195,13350,748,34141,598,0001,009,0002,117,632stderr