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 listAug 10, 2025 03:51rockyou1337rockyou1337Score: 59,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2025 03:5159,180513,838,987490,197,0001,000,0002,265,088
2Aug 10, 2025 03:5159,188512,719,397491,258,00002,519,040
3Aug 10, 2025 03:5159,192517,602,011491,296,00002,523,136
4Aug 10, 2025 03:5159,193513,435,470490,303,0001,000,0002,273,280
5Aug 10, 2025 03:5159,197519,165,296490,333,0001,000,0002,523,136
6Aug 10, 2025 03:5159,201515,708,200489,366,0002,001,0002,273,280