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 listJun 19, 2026 16:02Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:020304,054,950295,356,0001,202,0002,113,536expected "53688404456775265 ", got "53688405571660265 "
2Jun 19, 2026 16:0235,676303,622,976295,000,0001,111,0002,113,536
3Jun 19, 2026 16:0235,678303,564,842295,017,0001,118,0002,113,536
4Jun 19, 2026 16:0235,685303,657,843295,062,0001,125,0002,113,536
5Jun 19, 2026 16:0235,706303,793,644295,245,0001,123,0002,113,536
6Jun 19, 2026 16:0235,734304,139,345295,381,0001,214,0002,113,536
7Jun 19, 2026 16:0235,734304,031,842295,479,0001,120,0002,113,536
8Jun 19, 2026 16:0235,748304,136,982295,596,0001,114,0002,113,536
9Jun 19, 2026 16:0235,763304,774,262295,711,0001,122,0002,113,536