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 00:09Maya RebholzMaya RebholzScore: 15,994Success
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 00:1015,945142,244,619122,980,0009,368,0002,113,536
2May 20, 2026 00:1015,950143,083,359123,096,0009,296,0002,113,536
3May 20, 2026 00:1015,955142,364,714123,113,0009,315,0002,113,536
4May 20, 2026 00:1015,961142,574,863123,147,0009,330,0002,113,536
5May 20, 2026 00:1015,994144,834,555123,297,0009,459,0002,113,536
6May 20, 2026 00:1015,997145,821,134123,387,0009,391,0002,113,536
7May 20, 2026 00:1016,011145,054,771123,440,0009,459,0002,113,536
8May 20, 2026 00:1016,017143,028,435123,429,0009,520,0002,113,536
9May 20, 2026 00:1016,033144,784,620123,087,0009,994,0002,113,536