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 13, 2026 13:29Victor MerckléVictor MerckléScore: 7,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 13:307,89874,781,38965,560,00002,113,536
2May 13, 2026 13:307,90374,478,00564,559,0001,037,0002,113,536
3May 13, 2026 13:307,90574,876,52564,595,0001,022,0002,113,536
4May 13, 2026 13:307,91273,025,60464,667,0001,004,0002,113,536
5May 13, 2026 13:307,91275,666,69064,664,0001,008,0002,113,536
6May 13, 2026 13:307,91373,410,27964,629,0001,049,0002,113,536
7May 13, 2026 13:307,91875,090,63064,720,0001,001,0002,113,536
8May 13, 2026 13:308,02674,441,96765,609,0001,014,0002,113,536
9May 13, 2026 13:308,05974,208,77265,847,0001,043,0002,113,536