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 28, 2025 15:03Valentin KofmanValentin KofmanScore: 9,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 15:037,10882,428,20457,000,0002,000,0002,281,472
2Jun 28, 2025 15:037,10984,347,86557,008,0002,000,0002,265,088
3Jun 28, 2025 15:037,12787,520,68057,149,0002,005,0002,289,664
4Jun 28, 2025 15:039,04298,473,53474,045,0001,000,0002,277,376
5Jun 28, 2025 15:039,06299,934,23573,206,0002,005,0002,260,992
6Jun 28, 2025 15:039,062100,945,67273,212,0002,005,0002,289,664