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 5, 2026 11:40Kevin HeaveyKevin HeaveyScore: 20,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 11:4120,582180,377,007169,684,0001,148,0002,117,632
2Jul 5, 2026 11:4120,584180,520,746169,690,0001,162,0002,117,632
3Jul 5, 2026 11:4120,586180,486,429169,699,0001,169,0002,117,632
4Jul 5, 2026 11:4120,593180,438,474169,767,0001,156,0002,117,632
5Jul 5, 2026 11:4120,853182,749,527172,040,0001,043,0002,117,632
6Jul 5, 2026 11:4122,277194,489,181183,772,0001,133,0002,117,632
7Jul 5, 2026 11:4122,296194,669,826183,870,0001,192,0002,117,632
8Jul 5, 2026 11:4122,296194,520,539183,915,0001,145,0002,117,632
9Jul 5, 2026 11:4122,312194,821,859183,929,0001,265,0002,117,632