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 28, 2026 20:30Victor MerckléVictor MerckléScore: 4,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:304,73847,626,88038,294,0001,036,0002,113,536
2Aug 28, 2026 20:304,73947,563,03838,315,0001,021,0002,113,536
3Aug 28, 2026 20:304,74548,324,23038,347,0001,042,0002,113,536
4Aug 28, 2026 20:304,75648,520,46838,458,0001,021,0002,113,536
5Aug 28, 2026 20:304,77048,734,07538,579,0001,020,0002,113,536
6Aug 28, 2026 20:304,77847,999,73638,638,0001,024,0002,113,536
7Aug 28, 2026 20:304,81148,383,43938,911,0001,021,0002,113,536
8Aug 28, 2026 20:304,81749,021,15838,959,0001,027,0002,113,536
9Aug 28, 2026 20:304,86049,371,43539,305,0001,035,0002,113,536