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 14, 2026 22:54Kevin HeaveyKevin HeaveyScore: 3,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 22:553,92242,191,98631,536,0001,024,0002,117,632
2Jul 14, 2026 22:553,92542,265,47831,537,0001,042,0002,117,632
3Jul 14, 2026 22:553,92642,215,39831,570,0001,024,0002,117,632
4Jul 14, 2026 22:553,94642,279,97931,715,0001,037,0002,117,632
5Jul 14, 2026 22:553,95042,561,55431,744,0001,041,0002,117,632
6Jul 14, 2026 22:553,95442,444,23731,792,0001,030,0002,117,632
7Jul 14, 2026 22:553,95442,420,69331,780,0001,040,0002,117,632
8Jul 14, 2026 22:553,95742,412,92331,803,0001,042,0002,117,632
9Jul 14, 2026 22:553,96343,955,61831,857,0001,043,0002,117,632