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 5, 2026 19:00Kevin HeaveyKevin HeaveyScore: 5,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:005,64756,310,45845,724,0001,148,0002,117,632
2Jul 5, 2026 19:005,65856,459,11145,734,0001,231,0002,117,632
3Jul 5, 2026 19:005,66056,523,65245,837,0001,142,0002,117,632
4Jul 5, 2026 19:005,66756,586,94745,825,0001,219,0002,117,632
5Jul 5, 2026 19:005,67656,687,19345,940,0001,177,0002,117,632
6Jul 5, 2026 19:005,67956,679,96845,917,0001,224,0002,117,632
7Jul 5, 2026 19:005,76657,301,28046,624,0001,238,0002,117,632
8Jul 5, 2026 19:005,93858,840,87748,247,0001,041,0002,117,632
9Jul 5, 2026 19:005,95558,956,56748,202,0001,229,0002,117,632