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 7, 2026 14:31Kevin HeaveyKevin HeaveyScore: 4,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:324,28945,182,21334,412,0001,194,0002,117,632
2Jul 7, 2026 14:324,30645,303,52434,551,0001,195,0002,117,632
3Jul 7, 2026 14:324,30845,283,90334,543,0001,215,0002,117,632
4Jul 7, 2026 14:324,33845,577,76234,823,0001,186,0002,117,632
5Jul 7, 2026 14:324,36145,741,18535,012,0001,187,0002,117,632
6Jul 7, 2026 14:324,37745,925,29235,168,0001,168,0002,117,632
7Jul 7, 2026 14:324,37745,868,33635,119,0001,213,0002,117,632
8Jul 7, 2026 14:324,41646,162,52535,497,0001,159,0002,117,632
9Jul 7, 2026 14:324,52347,093,46536,367,0001,175,0002,117,632