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 16, 2026 23:53Kevin HeaveyKevin HeaveyScore: 3,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 23:583,72340,697,27829,757,0001,145,0002,113,536
2Jul 16, 2026 23:583,74840,858,12230,063,0001,049,0002,113,536
3Jul 16, 2026 23:583,75340,908,22430,104,0001,051,0002,113,536
4Jul 16, 2026 23:583,79641,226,50130,457,0001,051,0002,113,536
5Jul 16, 2026 23:583,80441,307,95430,526,0001,051,0002,113,536
6Jul 16, 2026 23:583,87942,004,31931,112,0001,087,0002,113,536
7Jul 16, 2026 23:583,92642,368,83231,542,0001,049,0002,113,536
8Jul 16, 2026 23:583,95742,585,86931,796,0001,048,0002,113,536
9Jul 16, 2026 23:584,08043,638,54432,820,0001,044,0002,113,536