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 21, 2026 14:53Kevin HeaveyKevin HeaveyScore: 3,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 15:073,64040,038,80329,167,0001,050,0002,113,536
2Jul 21, 2026 15:073,65940,730,48229,320,0001,050,0002,113,536
3Jul 21, 2026 15:073,66740,289,67129,387,0001,052,0002,113,536
4Jul 21, 2026 15:073,71940,724,83929,821,0001,053,0002,113,536
5Jul 21, 2026 15:073,78041,225,19230,319,0001,057,0002,113,536
6Jul 21, 2026 15:073,84241,727,28230,835,0001,055,0002,113,536
7Jul 21, 2026 15:073,86442,039,13331,031,0001,048,0002,113,536
8Jul 21, 2026 15:073,91643,070,16931,455,0001,048,0002,113,536
9Jul 21, 2026 15:073,92442,778,28131,523,0001,052,0002,113,536