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 16, 2026 04:53Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:536,96366,237,58657,798,00002,113,536
2May 16, 2026 04:536,96667,966,63957,823,00002,113,536
3May 16, 2026 04:536,96765,114,99756,827,0001,005,0002,113,536
4May 16, 2026 04:536,96766,080,71256,830,0001,001,0002,113,536
5May 16, 2026 04:536,96765,951,17456,822,0001,008,0002,113,536
6May 16, 2026 04:536,96867,302,89056,813,0001,023,0002,113,536
7May 16, 2026 04:536,96866,939,07756,805,0001,034,0002,113,536
8May 16, 2026 04:536,96965,237,54956,798,0001,049,0002,113,536
9May 16, 2026 04:536,97165,880,51656,847,0001,013,0002,113,536