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 17, 2026 03:51Kevin HeaveyKevin HeaveyScore: 3,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:573,66340,227,22729,360,0001,047,0002,113,536
2Jul 17, 2026 03:573,66640,244,07329,387,0001,047,0002,113,536
3Jul 17, 2026 03:573,70040,597,75829,666,0001,047,0002,113,536
4Jul 17, 2026 03:573,70440,646,85029,691,0001,057,0002,113,536
5Jul 17, 2026 03:573,73940,874,36629,985,0001,049,0002,113,536
6Jul 17, 2026 03:573,77750,525,40830,307,0001,047,0002,113,536
7Jul 17, 2026 03:573,92742,356,78031,551,0001,045,0002,113,536
8Jul 17, 2026 03:573,95342,641,16631,773,0001,043,0002,113,536
9Jul 17, 2026 03:573,95342,756,37831,795,0001,021,0002,113,536