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 25, 2026 02:00Victor MerckléVictor MerckléScore: 9,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:018,73480,845,66071,401,0001,098,0002,117,632stderr
2Aug 25, 2026 02:018,75481,288,70771,561,0001,100,0002,117,632stderr
3Aug 25, 2026 02:018,76281,107,09671,640,0001,092,0002,117,632stderr
4Aug 25, 2026 02:019,06983,688,17674,163,0001,113,0002,117,632stderr
5Aug 25, 2026 02:019,07583,758,43874,227,0001,099,0002,117,632stderr
6Aug 25, 2026 02:019,08783,802,94174,357,0001,071,0002,117,632stderr
7Aug 25, 2026 02:019,09383,898,26674,348,0001,132,0002,117,632stderr
8Aug 25, 2026 02:019,25385,200,43475,728,0001,074,0002,117,632stderr
9Aug 25, 2026 02:019,38593,429,45576,837,0001,062,0002,117,632stderr