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 19, 2026 14:29Victor MerckléVictor MerckléScore: 5,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:345,69956,141,47446,269,0001,036,0002,113,536
2May 19, 2026 14:345,70957,087,88146,328,0001,062,0002,113,536
3May 19, 2026 14:345,71356,522,73246,390,0001,033,0002,113,536
4May 19, 2026 14:345,71356,600,84946,403,0001,023,0002,113,536
5May 19, 2026 14:345,75757,785,04146,750,0001,036,0002,113,536
6May 19, 2026 14:345,78555,801,35546,996,0001,021,0002,113,536
7May 19, 2026 14:345,88058,036,36247,776,0001,036,0002,113,536
8May 19, 2026 14:345,88158,744,02247,796,0001,022,0002,113,536
9May 19, 2026 14:345,92558,538,60948,149,0001,029,0002,113,536