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 22:16Victor MerckléVictor MerckléScore: 6,957Success
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 22:176,95066,852,03456,681,0001,011,0002,113,536
2May 15, 2026 22:176,95066,545,30556,650,0001,043,0002,113,536
3May 15, 2026 22:176,95467,897,38156,695,0001,026,0002,113,536
4May 15, 2026 22:176,95567,081,42056,697,0001,031,0002,113,536
5May 15, 2026 22:176,95765,773,73656,699,0001,052,0002,113,536
6May 15, 2026 22:176,96772,584,43956,813,0001,016,0002,113,536
7May 15, 2026 22:176,96867,773,44257,839,00002,113,536
8May 15, 2026 22:177,00866,312,53457,142,0001,025,0002,113,536
9May 15, 2026 22:177,01367,887,50457,206,0001,003,0002,113,536