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 13:11Kevin HeaveyKevin HeaveyScore: 20,295Success
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 13:1218,516162,832,844152,667,0001,024,0002,117,632
2Jul 5, 2026 13:1218,530164,270,934152,797,0001,008,0002,117,632
3Jul 5, 2026 13:1220,284177,559,022167,232,0001,129,0002,117,632
4Jul 5, 2026 13:1220,293177,668,431167,278,0001,160,0002,117,632
5Jul 5, 2026 13:1220,295177,681,042167,432,0001,020,0002,117,632
6Jul 5, 2026 13:1220,296177,595,742167,347,0001,116,0002,117,632
7Jul 5, 2026 13:1220,299177,597,669167,347,0001,136,0002,117,632
8Jul 5, 2026 13:1220,303177,742,101167,455,0001,064,0002,117,632
9Jul 5, 2026 13:1220,325177,890,095167,580,0001,125,0002,117,632