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 listOct 30, 2025 06:32Anton SkvortsovAnton SkvortsovScore: 90,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2025 06:3289,930771,001,292520,595,000225,824,0002,465,792
2Oct 30, 2025 06:3289,948779,038,041518,699,000227,867,0002,457,600
3Oct 30, 2025 06:3290,369774,123,769519,353,000230,712,0002,310,144
4Oct 30, 2025 06:3290,400778,850,289520,531,000229,793,0002,314,240
5Oct 30, 2025 06:3290,431778,129,711519,705,000230,869,0002,457,600
6Oct 30, 2025 06:3290,563779,869,697519,773,000231,898,0002,461,696
7Oct 30, 2025 06:3290,590780,512,959519,239,000232,659,0002,469,888
8Oct 30, 2025 06:3290,789778,959,354520,687,000232,860,0002,342,912
9Oct 30, 2025 06:3290,798778,445,737519,740,000233,883,0002,465,792