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:45Kevin HeaveyKevin HeaveyScore: 3,746Success
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:503,72340,653,33429,861,0001,048,0002,113,536
2Jul 16, 2026 23:503,73040,949,89129,919,0001,048,0002,113,536
3Jul 16, 2026 23:503,73540,903,74529,951,0001,050,0002,113,536
4Jul 16, 2026 23:503,74340,857,10330,041,0001,027,0002,113,536
5Jul 16, 2026 23:503,74640,908,75130,065,0001,027,0002,113,536
6Jul 16, 2026 23:503,74940,939,67130,072,0001,052,0002,113,536
7Jul 16, 2026 23:503,88742,082,40331,218,0001,050,0002,113,536
8Jul 16, 2026 23:503,93942,489,56631,649,0001,046,0002,113,536
9Jul 16, 2026 23:503,94442,458,26231,609,0001,130,0002,113,536