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 20:49Victor MerckléVictor MerckléScore: 7,077Success
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 20:497,03466,637,89157,236,0001,147,0002,113,536
2Aug 26, 2026 20:497,04867,589,07957,354,0001,151,0002,113,536
3Aug 26, 2026 20:497,05866,913,79757,408,0001,177,0002,113,536
4Aug 26, 2026 20:497,06666,959,62857,466,0001,184,0002,113,536
5Aug 26, 2026 20:497,07766,933,76457,462,0001,283,0002,113,536
6Aug 26, 2026 20:497,09567,198,48857,792,0001,097,0002,113,536
7Aug 26, 2026 20:497,20768,904,41158,715,0001,104,0002,113,536
8Aug 26, 2026 20:497,24269,116,57959,001,0001,108,0002,113,536
9Aug 26, 2026 20:497,33469,798,50859,789,0001,086,0002,113,536