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 19, 2026 13:47Kevin HeaveyKevin HeaveyScore: 3,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 13:483,60939,900,60128,806,0001,155,0002,113,536
2Jul 19, 2026 13:483,61439,597,45428,786,0001,213,0002,113,536
3Jul 19, 2026 13:483,63239,777,95428,992,0001,156,0002,113,536
4Jul 19, 2026 13:483,72140,546,95329,849,0001,043,0002,113,536
5Jul 19, 2026 13:483,79441,126,99930,362,0001,135,0002,113,536
6Jul 19, 2026 13:483,82241,442,38830,559,0001,166,0002,113,536
7Jul 19, 2026 13:483,85241,629,81530,932,0001,047,0002,113,536
8Jul 19, 2026 13:483,88941,881,19531,131,0001,149,0002,113,536
9Jul 19, 2026 13:483,91342,418,53031,440,0001,046,0002,113,536