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 19, 2026 21:21Genos0Genos0Score: 61,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 21:2161,438533,081,835507,935,0001,999,0002,502,656
2Mar 19, 2026 21:2161,447537,389,227508,006,0002,000,0002,359,296
3Mar 19, 2026 21:2161,448542,077,680508,019,0002,000,0002,502,656
4Mar 19, 2026 21:2161,470539,550,127509,204,0001,000,0002,359,296
5Mar 19, 2026 21:2161,472538,028,241508,220,0002,000,0002,363,392
6Mar 19, 2026 21:2161,473542,184,355509,227,0001,000,0002,359,296
7Mar 19, 2026 21:2161,486536,308,122508,339,0001,997,0002,359,296
8Mar 19, 2026 21:2161,513546,216,717508,558,0001,998,0002,330,624
9Mar 19, 2026 21:2161,521535,951,975507,629,0002,997,0002,318,336