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 29, 2026 03:50Victor MerckléVictor MerckléScore: 5,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 03:525,07450,027,63741,096,0001,024,0002,113,536
2Jun 29, 2026 03:525,07550,052,32541,098,0001,030,0002,113,536
3Jun 29, 2026 03:525,07850,099,39741,150,0001,000,0002,113,536
4Jun 29, 2026 03:525,08550,082,88041,165,0001,042,0002,113,536
5Jun 29, 2026 03:525,08750,172,03741,184,0001,045,0002,113,536
6Jun 29, 2026 03:525,08850,088,23641,231,0001,005,0002,113,536
7Jun 29, 2026 03:525,09650,246,75841,260,0001,045,0002,113,536
8Jun 29, 2026 03:525,15650,698,68341,718,0001,082,0002,113,536
9Jun 29, 2026 03:525,16950,829,62441,870,0001,036,0002,113,536