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 listJul 21, 2026 19:00Kevin HeaveyKevin HeaveyScore: 3,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 19:073,91642,302,70631,482,0001,022,0002,113,536
2Jul 21, 2026 19:073,92744,995,51231,437,0001,163,0002,113,536
3Jul 21, 2026 19:073,97042,777,57131,907,0001,044,0002,113,536
4Jul 21, 2026 19:073,97742,849,55431,971,0001,046,0002,113,536
5Jul 21, 2026 19:073,99343,043,73632,103,0001,043,0002,113,536
6Jul 21, 2026 19:074,00045,993,98432,165,0001,041,0002,113,536
7Jul 21, 2026 19:074,13144,676,42433,248,0001,041,0002,113,536
8Jul 21, 2026 19:074,26145,457,95234,330,0001,040,0002,113,536
9Jul 21, 2026 19:074,28448,924,19434,521,0001,040,0002,113,536