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 listJul 17, 2026 03:29Kevin HeaveyKevin HeaveyScore: 3,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:313,71240,595,25929,567,0001,246,0002,117,632
2Jul 17, 2026 03:313,71940,608,04029,852,0001,022,0002,117,632
3Jul 17, 2026 03:313,72140,654,12229,864,0001,025,0002,117,632
4Jul 17, 2026 03:313,74042,704,90730,014,0001,032,0002,117,632
5Jul 17, 2026 03:313,76841,000,60230,239,0001,043,0002,117,632
6Jul 17, 2026 03:313,76940,978,84930,006,0001,281,0002,117,632
7Jul 17, 2026 03:313,80641,409,16930,551,0001,040,0002,117,632
8Jul 17, 2026 03:314,22652,472,23734,060,0001,024,0002,117,632
9Jul 17, 2026 03:314,45855,527,61235,902,0001,103,0002,117,632