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 20, 2026 05:26M-RochatM-RochatScore: 12,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:2712,760118,309,882102,834,0003,077,0002,113,536
2May 20, 2026 05:2712,767116,154,080102,905,0003,065,0002,113,536
3May 20, 2026 05:2712,785117,259,644103,007,0003,116,0002,113,536
4May 20, 2026 05:2712,787118,440,447103,015,0003,123,0002,113,536
5May 20, 2026 05:2712,806118,605,561103,211,0003,086,0002,113,536
6May 20, 2026 05:2712,829117,519,159103,343,0003,143,0002,113,536
7May 20, 2026 05:2712,829118,371,055103,364,0003,122,0002,113,536
8May 20, 2026 05:2712,831117,863,170103,367,0003,137,0002,113,536
9May 20, 2026 05:2712,867119,333,148103,658,0003,141,0002,113,536