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:38M-RochatM-RochatScore: 13,299Success
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:3913,274121,743,279108,086,0002,096,0002,113,536
2May 20, 2026 05:3913,281120,181,698108,116,0002,119,0002,113,536
3May 20, 2026 05:3913,284120,589,167108,153,0002,106,0002,113,536
4May 20, 2026 05:3913,284121,823,142108,164,0002,098,0002,113,536
5May 20, 2026 05:3913,299123,016,905108,271,0002,114,0002,113,536
6May 20, 2026 05:3913,302121,464,824108,296,0002,117,0002,113,536
7May 20, 2026 05:3913,313122,457,012108,403,0002,098,0002,113,536
8May 20, 2026 05:3913,316119,892,977108,443,0002,085,0002,113,536
9May 20, 2026 05:3913,325121,811,049108,478,0002,121,0002,113,536