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 21:46Victor MerckléVictor MerckléScore: 6,955Success
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 21:466,95165,660,80456,683,0001,016,0002,113,536
2May 15, 2026 21:466,95265,188,95157,704,00002,113,536
3May 15, 2026 21:466,95366,847,76556,660,0001,050,0002,113,536
4May 15, 2026 21:466,95565,464,52757,728,00002,113,536
5May 15, 2026 21:466,95565,051,43156,724,0001,007,0002,113,536
6May 15, 2026 21:466,95567,011,55356,726,0001,006,0002,113,536
7May 15, 2026 21:467,00566,913,69257,140,0001,008,0002,113,536
8May 15, 2026 21:467,01968,550,18657,233,0001,032,0002,113,536
9May 15, 2026 21:467,09166,941,75357,852,0001,011,0002,113,536