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 6, 2026 07:59Teow Hua JunTeow Hua JunScore: 12,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 08:0112,377112,152,186100,188,0002,547,0002,113,536
2Jul 6, 2026 08:0112,562113,637,251101,865,0002,403,0002,113,536
3Jul 6, 2026 08:0112,567113,650,658101,706,0002,606,0002,113,536
4Jul 6, 2026 08:0112,601113,972,702102,143,0002,449,0002,113,536
5Jul 6, 2026 08:0112,693114,758,275102,943,0002,414,0002,113,536
6Jul 6, 2026 08:0112,745115,214,350103,159,0002,628,0002,113,536
7Jul 6, 2026 08:0112,765115,369,799103,402,0002,553,0002,113,536
8Jul 6, 2026 08:0112,776115,453,235103,449,0002,598,0002,113,536
9Jul 6, 2026 08:0113,001127,555,204105,268,0002,646,0002,113,536