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 listJul 7, 2026 04:21Victor MerckléVictor MerckléScore: 5,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:235,58354,423,34845,288,0001,054,0002,117,632stderr
2Jul 7, 2026 04:235,58454,396,19845,212,0001,143,0002,117,632stderr
3Jul 7, 2026 04:235,58654,531,48745,296,0001,071,0002,117,632stderr
4Jul 7, 2026 04:235,58754,426,44845,227,0001,148,0002,117,632stderr
5Jul 7, 2026 04:235,58854,468,95945,254,0001,133,0002,117,632stderr
6Jul 7, 2026 04:235,58854,528,85145,233,0001,150,0002,117,632stderr
7Jul 7, 2026 04:235,59554,536,79245,274,0001,168,0002,117,632stderr
8Jul 7, 2026 04:235,60754,607,97245,412,0001,132,0002,117,632stderr
9Jul 7, 2026 04:235,62863,467,67145,622,0001,092,0002,117,632stderr