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 9, 2026 16:21Victor MerckléVictor MerckléScore: 18,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 16:2218,052157,766,719148,709,0001,125,0002,117,632stderr
2Jul 9, 2026 16:2218,070157,847,190148,858,0001,126,0002,117,632stderr
3Jul 9, 2026 16:2218,104158,194,447149,141,0001,130,0002,117,632stderr
4Jul 9, 2026 16:2218,160158,633,606149,694,0001,034,0002,117,632stderr
5Jul 9, 2026 16:2218,191158,896,837149,882,0001,110,0002,117,632stderr
6Jul 9, 2026 16:2218,199158,940,606149,946,0001,110,0002,117,632stderr
7Jul 9, 2026 16:2218,200159,082,392150,047,0001,013,0002,117,632stderr
8Jul 9, 2026 16:2218,206159,012,990150,094,0001,022,0002,117,632stderr
9Jul 9, 2026 16:2218,297159,741,520150,753,0001,114,0002,117,632stderr