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 listDec 26, 2025 19:23hunaphuhunaphuScore: 48,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 19:2348,605430,411,853403,420,00002,269,184
2Dec 26, 2025 19:2348,619428,396,951402,539,0001,001,0002,396,160
3Dec 26, 2025 19:2348,633430,525,849400,658,0002,997,0002,269,184
4Dec 26, 2025 19:2348,633432,031,783402,657,000999,0002,269,184
5Dec 26, 2025 19:2348,636429,731,769403,682,00002,510,848
6Dec 26, 2025 19:2348,639432,121,463401,707,0001,998,0002,269,184
7Dec 26, 2025 19:2348,642425,734,547401,728,0001,998,0002,269,184
8Dec 26, 2025 19:2348,723431,991,471402,398,0002,001,0002,269,184
9Dec 26, 2025 19:2348,748431,373,147402,607,0001,998,0002,269,184