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 15, 2026 17:24Victor 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 15, 2026 17:246,96367,263,51156,755,0001,044,0002,113,536
2May 15, 2026 17:246,96465,170,28756,784,0001,024,0002,113,536
3May 15, 2026 17:246,96567,405,69656,785,0001,028,0002,113,536
4May 15, 2026 17:246,96565,200,79857,815,00002,113,536
5May 15, 2026 17:246,96766,406,15456,798,0001,029,0002,113,536
6May 15, 2026 17:246,96867,432,55856,833,0001,003,0002,113,536
7May 15, 2026 17:246,97667,267,06956,889,0001,018,0002,113,536
8May 15, 2026 17:246,98666,648,93856,939,0001,047,0002,113,536
9May 15, 2026 17:247,02366,210,65657,249,0001,048,0002,113,536