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 10, 2026 19:58Josu San MartinJosu San MartinScore: 5,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 19:585,07166,811,18740,084,0002,004,0002,281,472
2Mar 10, 2026 19:585,12062,878,50541,485,0001,011,0002,408,448
3Mar 10, 2026 19:585,18470,496,12541,030,0002,001,0002,281,472
4Mar 10, 2026 19:585,31966,781,25542,141,0002,006,0002,281,472
5Mar 10, 2026 19:585,33065,403,15642,231,0002,011,0002,281,472
6Mar 10, 2026 19:585,33164,505,03242,239,0002,011,0002,416,640