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 17, 2026 09:30M-RochatM-RochatScore: 12,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 09:3012,609114,274,097102,486,0002,172,0002,113,536
2May 17, 2026 09:3012,622116,490,310102,608,0002,159,0002,113,536
3May 17, 2026 09:3012,648113,916,146102,821,0002,162,0002,113,536
4May 17, 2026 09:3012,658114,463,630102,913,0002,149,0002,113,536
5May 17, 2026 09:3012,660114,760,149102,904,0002,180,0002,113,536
6May 17, 2026 09:3012,660115,764,216102,892,0002,187,0002,113,536
7May 17, 2026 09:3012,663115,027,757102,943,0002,165,0002,113,536
8May 17, 2026 09:3012,664115,755,972102,948,0002,164,0002,113,536
9May 17, 2026 09:3012,687114,508,832103,102,0002,205,0002,113,536