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 listMar 23, 2026 03:00Alyssa VerkadeAlyssa VerkadeScore: 72,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 03:0072,902628,671,265605,088,00002,367,488
2Mar 23, 2026 03:0072,908630,702,273605,139,00002,289,664
3Mar 23, 2026 03:0072,982633,636,115604,748,000999,0002,359,296
4Mar 23, 2026 03:0072,990630,781,366604,820,000999,0002,359,296
5Mar 23, 2026 03:0072,991630,535,632604,823,000999,0002,351,104
6Mar 23, 2026 03:0073,061633,125,364604,407,0001,998,0002,465,792
7Mar 23, 2026 03:0073,082636,741,253605,578,000999,0002,289,664
8Mar 23, 2026 03:0073,137628,369,732607,040,00002,367,488
9Mar 23, 2026 03:0073,334633,997,681606,676,0001,998,0002,367,488