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 listMay 20, 2026 15:20Victor MerckléVictor MerckléScore: 5,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:255,53453,684,17144,884,0001,054,0002,113,536
2May 20, 2026 15:255,55956,793,15045,137,0001,004,0002,113,536
3May 20, 2026 15:255,56155,360,47145,133,0001,025,0002,113,536
4May 20, 2026 15:255,56453,950,81145,164,0001,019,0002,113,536
5May 20, 2026 15:255,58354,327,16745,318,0001,029,0002,113,536
6May 20, 2026 15:255,62955,238,07045,667,0001,057,0002,113,536
7May 20, 2026 15:255,66257,152,01845,963,0001,034,0002,113,536
8May 20, 2026 15:255,67758,095,88646,091,0001,033,0002,113,536
9May 20, 2026 15:255,90958,612,96547,008,0002,041,0002,113,536