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 03:51Kevin HeaveyKevin HeaveyScore: 3,972Success
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 03:523,75640,827,53830,139,0001,042,0002,117,632
2Jul 16, 2026 03:523,82041,323,74930,492,0001,214,0002,117,632
3Jul 16, 2026 03:523,85641,646,12830,781,0001,228,0002,117,632
4Jul 16, 2026 03:523,95742,591,73031,614,0001,232,0002,117,632
5Jul 16, 2026 03:523,97242,594,88131,763,0001,209,0002,117,632
6Jul 16, 2026 03:524,00242,849,68931,980,0001,237,0002,117,632
7Jul 16, 2026 03:524,17544,383,15129,212,0005,442,0002,117,632
8Jul 16, 2026 03:524,22344,723,82629,251,0005,802,0002,117,632
9Jul 16, 2026 03:524,34045,744,73730,592,0005,438,0002,117,632