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 2, 2026 18:16A_ShamanA_ShamanScore: 37,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:1637,825325,339,366311,937,0002,012,0002,113,536
2Jul 2, 2026 18:1637,828323,978,276311,966,0002,009,0002,113,536
3Jul 2, 2026 18:1637,841324,219,559311,971,0002,115,0002,113,536
4Jul 2, 2026 18:1637,873324,365,613312,308,0002,039,0002,113,536
5Jul 2, 2026 18:1637,874324,378,493312,302,0002,060,0002,113,536
6Jul 2, 2026 18:1637,895324,471,198312,495,0002,037,0002,113,536
7Jul 2, 2026 18:1637,900324,576,226312,523,0002,049,0002,113,536
8Jul 2, 2026 18:1637,907324,713,860312,601,0002,031,0002,113,536
9Jul 2, 2026 18:1637,934324,896,941312,843,0002,015,0002,113,536