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 16:54Victor MerckléVictor MerckléScore: 3,801Success
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 16:563,77639,719,25030,150,0001,194,0002,113,536
2Aug 27, 2026 16:563,78439,853,03930,203,0001,208,0002,113,536
3Aug 27, 2026 16:563,78539,818,87530,243,0001,178,0002,113,536
4Aug 27, 2026 16:563,79740,535,86730,309,0001,208,0002,113,536
5Aug 27, 2026 16:563,80139,925,47630,432,0001,117,0002,113,536
6Aug 27, 2026 16:563,80239,903,51030,413,0001,149,0002,113,536
7Aug 27, 2026 16:563,80739,986,89030,416,0001,188,0002,113,536
8Aug 27, 2026 16:563,80739,994,32730,418,0001,184,0002,113,536
9Aug 27, 2026 16:564,01541,696,48332,170,0001,158,0002,113,536