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 3, 2026 21:01Josu San MartinJosu San MartinScore: 22,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 21:0222,843198,969,130186,096,0003,506,0002,113,536
2Jul 3, 2026 21:0222,850198,998,313186,140,0003,523,0002,113,536
3Jul 3, 2026 21:0222,853199,057,819186,272,0003,410,0002,113,536
4Jul 3, 2026 21:0222,928199,642,562186,964,0003,344,0002,113,536
5Jul 3, 2026 21:0222,949199,837,570187,044,0003,439,0002,113,536
6Jul 3, 2026 21:0222,950199,841,150187,120,0003,368,0002,113,536
7Jul 3, 2026 21:0223,090201,098,995188,255,0003,400,0002,113,536
8Jul 3, 2026 21:0223,170201,717,260188,796,0003,521,0002,113,536
9Jul 3, 2026 21:0223,318204,151,310190,005,0003,541,0002,113,536