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 6, 2026 19:18Kevin HeaveyKevin HeaveyScore: 12,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 19:1912,615114,240,793103,627,0001,081,0002,117,632
2Jul 6, 2026 19:1912,620114,279,358103,614,0001,140,0002,117,632
3Jul 6, 2026 19:1912,623114,279,489103,609,0001,164,0002,117,632
4Jul 6, 2026 19:1912,623115,675,680103,622,0001,156,0002,117,632
5Jul 6, 2026 19:1912,627114,293,835103,677,0001,130,0002,117,632
6Jul 6, 2026 19:1912,629114,321,799103,674,0001,149,0002,117,632
7Jul 6, 2026 19:1912,631114,408,797103,653,0001,189,0002,117,632
8Jul 6, 2026 19:1912,651114,476,306103,844,0001,162,0002,117,632
9Jul 6, 2026 19:1912,745115,261,434104,735,0001,051,0002,117,632