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 16, 2026 01:46Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:46065,912,53156,763,0001,013,0002,113,536expected "53683771623118301 ", got "53683769319118301 "
2May 16, 2026 01:466,95065,025,10357,693,00002,113,536
3May 16, 2026 01:466,95165,168,46757,699,00002,113,536
4May 16, 2026 01:466,95965,204,82956,745,0001,016,0002,113,536
5May 16, 2026 01:466,97867,204,22056,908,0001,017,0002,113,536
6May 16, 2026 01:467,00067,330,62458,107,00002,113,536
7May 16, 2026 01:467,00467,277,63958,135,00002,113,536
8May 16, 2026 01:467,01166,300,02857,186,0001,011,0002,113,536
9May 16, 2026 01:467,07767,466,32458,741,00002,113,536