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 15, 2026 08:39Andrew TsibinAndrew TsibinScore: 4,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 08:404,31245,495,89234,606,0001,187,0002,113,536
2Jul 15, 2026 08:404,31645,632,73234,686,0001,145,0002,113,536
3Jul 15, 2026 08:404,32145,543,98434,710,0001,157,0002,113,536
4Jul 15, 2026 08:404,38646,636,75135,214,0001,198,0002,113,536
5Jul 15, 2026 08:404,40446,802,57235,513,0001,048,0002,113,536
6Jul 15, 2026 08:404,40646,790,23335,344,0001,231,0002,113,536
7Jul 15, 2026 08:404,40946,175,36335,443,0001,159,0002,113,536
8Jul 15, 2026 08:404,41646,435,85435,494,0001,165,0002,113,536
9Jul 15, 2026 08:404,42746,362,77935,600,0001,145,0002,113,536