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 listJul 1, 2026 22:03Code HintsCode HintsScore: 6,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:066,14458,710,30748,932,0002,066,0002,113,536
2Jul 1, 2026 22:066,14960,378,94348,980,0002,060,0002,113,536
3Jul 1, 2026 22:066,15859,089,17549,041,0002,072,0002,113,536
4Jul 1, 2026 22:066,16758,924,07049,155,0002,036,0002,113,536
5Jul 1, 2026 22:066,18459,259,46849,125,0002,210,0002,113,536
6Jul 1, 2026 22:066,21859,334,13849,573,0002,041,0002,113,536
7Jul 1, 2026 22:066,23359,532,87149,700,0002,041,0002,113,536
8Jul 1, 2026 22:066,24459,564,39149,775,0002,053,0002,113,536
9Jul 1, 2026 22:066,27560,038,73350,040,0002,044,0002,113,536