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 8, 2025 01:31Marco BarboneMarco BarboneScore: 35,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2025 01:3135,157316,322,237289,802,0001,998,0002,527,232
2Oct 8, 2025 01:3135,237324,204,136291,464,0001,001,0002,289,664
3Oct 8, 2025 01:3135,288320,294,518291,891,000999,0002,289,664
4Oct 8, 2025 01:3135,292322,330,003290,924,0001,999,0002,269,184
5Oct 8, 2025 01:3135,300318,316,516291,990,000999,0002,289,664
6Oct 8, 2025 01:3135,332318,123,670291,251,0002,001,0002,289,664
7Oct 8, 2025 01:3135,393316,719,535291,764,0001,998,0002,269,184
8Oct 8, 2025 01:3136,013320,771,629297,911,000999,0002,289,664
9Oct 8, 2025 01:3136,837334,220,421303,746,0001,998,0002,289,664