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 12, 2026 13:20Victor MerckléVictor MerckléScore: 3,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:203,77839,807,21430,267,0001,092,0002,117,632stderr
2Aug 12, 2026 13:203,78939,943,84130,269,0001,180,0002,117,632stderr
3Aug 12, 2026 13:203,79639,951,42130,377,0001,134,0002,117,632stderr
4Aug 12, 2026 13:203,80640,763,55830,446,0001,152,0002,117,632stderr
5Aug 12, 2026 13:203,81240,065,52430,560,0001,083,0002,117,632stderr
6Aug 12, 2026 13:203,84940,347,99530,880,0001,073,0002,117,632stderr
7Aug 12, 2026 13:203,86640,496,68031,070,0001,026,0002,117,632stderr
8Aug 12, 2026 13:204,04341,848,94732,469,0001,093,0002,117,632stderr
9Aug 12, 2026 13:204,09942,898,59432,961,0001,061,0002,117,632stderr