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 11:51Kevin HeaveyKevin HeaveyScore: 3,797Success
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 12:033,62339,963,92529,024,0001,050,0002,113,536
2Jul 21, 2026 12:033,63940,096,72129,151,0001,058,0002,113,536
3Jul 21, 2026 12:033,65240,251,73429,263,0001,053,0002,113,536
4Jul 21, 2026 12:033,70843,073,08529,730,0001,049,0002,113,536
5Jul 21, 2026 12:033,79741,460,61530,453,0001,067,0002,113,536
6Jul 21, 2026 12:033,91242,948,77331,439,0001,038,0002,113,536
7Jul 21, 2026 12:033,91745,218,13731,465,0001,054,0002,113,536
8Jul 21, 2026 12:033,93342,748,97431,601,0001,050,0002,113,536
9Jul 21, 2026 12:033,93342,558,19131,616,0001,030,0002,113,536