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 listMay 15, 2026 13:25Victor MerckléVictor MerckléScore: 6,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:256,96468,224,18257,808,00002,113,536
2May 15, 2026 13:256,96865,555,31757,840,00002,113,536
3May 15, 2026 13:256,97167,937,46356,837,0001,026,0002,113,536
4May 15, 2026 13:256,97366,953,33456,859,0001,018,0002,113,536
5May 15, 2026 13:256,97465,188,54257,889,00002,113,536
6May 15, 2026 13:256,98368,095,42056,947,0001,015,0002,113,536
7May 15, 2026 13:256,98667,560,46156,981,0001,006,0002,113,536
8May 15, 2026 13:257,03068,819,21257,332,0001,022,0002,113,536
9May 15, 2026 13:257,13670,959,88659,234,00002,113,536