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 29, 2026 17:48Josu San MartinJosu San MartinScore: 4,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:504,48245,623,73836,175,0001,031,0002,113,536
2Aug 29, 2026 17:504,49245,725,57836,182,0001,102,0002,113,536
3Aug 29, 2026 17:504,49545,767,19136,192,0001,121,0002,113,536
4Aug 29, 2026 17:504,50345,780,09136,269,0001,106,0002,113,536
5Aug 29, 2026 17:504,50845,822,70536,301,0001,123,0002,113,536
6Aug 29, 2026 17:504,51145,927,40136,317,0001,130,0002,113,536
7Aug 29, 2026 17:504,51845,902,34236,390,0001,116,0002,113,536
8Aug 29, 2026 17:504,52545,958,57436,444,0001,120,0002,113,536
9Aug 29, 2026 17:504,53046,025,55636,465,0001,136,0002,113,536