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 27, 2026 01:55Victor MerckléVictor MerckléScore: 3,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:553,95741,194,91631,833,0001,017,0002,113,536
2Aug 27, 2026 01:553,97241,111,24131,954,0001,018,0002,113,536
3Aug 27, 2026 01:553,97441,190,36931,967,0001,020,0002,113,536
4Aug 27, 2026 01:553,97741,370,01731,997,0001,016,0002,113,536
5Aug 27, 2026 01:553,98041,449,18432,016,0001,019,0002,113,536
6Aug 27, 2026 01:554,01341,670,90632,293,0001,016,0002,113,536
7Aug 27, 2026 01:554,01742,367,51332,323,0001,020,0002,113,536
8Aug 27, 2026 01:554,12642,630,08733,227,0001,020,0002,113,536
9Aug 27, 2026 01:554,13642,697,68033,315,0001,015,0002,113,536