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 26, 2026 23:06Code HintsCode HintsScore: 12,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 23:0912,450111,049,681102,331,0001,006,0002,113,536
2Jun 26, 2026 23:0912,451110,836,514102,339,0001,005,0002,113,536
3Jun 26, 2026 23:0912,481112,449,943102,588,0001,006,0002,113,536
4Jun 26, 2026 23:0912,481111,062,619102,591,0001,006,0002,113,536
5Jun 26, 2026 23:0912,487111,417,714102,640,0001,006,0002,113,536
6Jun 26, 2026 23:0912,494111,401,561102,701,0001,006,0002,113,536
7Jun 26, 2026 23:0912,507111,272,434102,806,0001,006,0002,113,536
8Jun 26, 2026 23:0912,526111,500,038102,965,0001,005,0002,113,536
9Jun 26, 2026 23:0912,553111,710,340103,176,0001,014,0002,113,536