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:39Victor MerckléVictor MerckléScore: 4,296Success
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:404,25443,674,00634,242,0001,074,0002,117,632stderr
2Aug 27, 2026 01:404,26143,641,97234,218,0001,151,0002,117,632stderr
3Aug 27, 2026 01:404,26143,641,73934,239,0001,131,0002,117,632stderr
4Aug 27, 2026 01:404,29044,007,40934,465,0001,143,0002,117,632stderr
5Aug 27, 2026 01:404,29644,686,93734,523,0001,138,0002,117,632stderr
6Aug 27, 2026 01:404,29743,969,01834,519,0001,150,0002,117,632stderr
7Aug 27, 2026 01:404,31644,184,63334,739,0001,084,0002,117,632stderr
8Aug 27, 2026 01:404,32044,180,25334,642,0001,222,0002,117,632stderr
9Aug 27, 2026 01:404,36744,611,29135,115,0001,138,0002,117,632stderr