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 14, 2026 06:14Victor MerckléVictor MerckléScore: 7,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:146,99467,519,37458,055,00002,113,536
2May 14, 2026 06:146,99666,499,51858,070,00002,113,536
3May 14, 2026 06:146,99666,428,92557,028,0001,047,0002,113,536
4May 14, 2026 06:146,99765,739,36757,062,0001,016,0002,113,536
5May 14, 2026 06:147,00366,150,45257,085,0001,044,0002,113,536
6May 14, 2026 06:147,00965,727,62257,139,0001,039,0002,113,536
7May 14, 2026 06:147,01566,336,39857,192,0001,040,0002,113,536
8May 14, 2026 06:147,04467,989,79658,466,00002,113,536
9May 14, 2026 06:147,14267,608,05358,264,0001,021,0002,113,536