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 12:52Victor MerckléVictor MerckléScore: 6,971Success
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 12:536,96466,127,65857,806,00002,113,536
2May 15, 2026 12:536,96568,044,87757,811,00002,113,536
3May 15, 2026 12:536,96665,830,71457,822,00002,113,536
4May 15, 2026 12:536,97065,426,93556,845,0001,007,0002,113,536
5May 15, 2026 12:536,97165,637,02856,844,0001,017,0002,113,536
6May 15, 2026 12:536,97565,857,25856,849,0001,047,0002,113,536
7May 15, 2026 12:536,98565,690,10356,977,0001,005,0002,113,536
8May 15, 2026 12:536,98767,982,04257,999,00002,113,536
9May 15, 2026 12:536,99066,098,40858,020,00002,113,536