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 listJun 8, 2026 08:32chereshnya123chereshnya123Score: 61,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 08:3261,562520,013,443453,856,00057,110,0002,113,536
2Jun 8, 2026 08:3261,565520,071,722453,924,00057,072,0002,113,536
3Jun 8, 2026 08:3261,613520,547,789453,940,00057,450,0002,113,536
4Jun 8, 2026 08:3261,639520,848,568453,627,00057,978,0002,113,536
5Jun 8, 2026 08:3261,640522,491,776454,086,00057,532,0002,113,536
6Jun 8, 2026 08:3261,696521,196,155453,545,00058,540,0002,113,536
7Jun 8, 2026 08:3261,699521,284,668453,943,00058,161,0002,113,536
8Jun 8, 2026 08:3261,701521,187,679453,763,00058,363,0002,113,536
9Jun 8, 2026 08:3261,763521,802,680453,807,00058,832,0002,113,536