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 18, 2026 15:15Kevin HeaveyKevin HeaveyScore: 3,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:173,60039,510,78228,689,0001,191,0002,113,536
2Jul 18, 2026 15:173,61039,812,97628,923,0001,047,0002,113,536
3Jul 18, 2026 15:173,61739,652,08129,001,0001,025,0002,113,536
4Jul 18, 2026 15:173,62239,723,17928,919,0001,149,0002,113,536
5Jul 18, 2026 15:173,62341,491,85628,867,0001,206,0002,113,536
6Jul 18, 2026 15:173,74352,018,14329,932,0001,139,0002,113,536
7Jul 18, 2026 15:173,78350,249,86830,186,0001,218,0002,113,536
8Jul 18, 2026 15:173,79749,464,46230,293,0001,223,0002,113,536
9Jul 18, 2026 15:173,86849,450,82630,970,0001,138,0002,113,536