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 22, 2026 03:47Kevin HeaveyKevin HeaveyScore: 3,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 03:483,55339,185,64328,274,0001,216,0002,113,536
2Jul 22, 2026 03:483,77141,588,72030,094,0001,209,0002,113,536
3Jul 22, 2026 03:483,78641,306,51530,276,0001,149,0002,113,536
4Jul 22, 2026 03:483,79641,176,29130,370,0001,141,0002,113,536
5Jul 22, 2026 03:483,82841,528,48430,630,0001,144,0002,113,536
6Jul 22, 2026 03:483,85042,311,14030,764,0001,192,0002,113,536
7Jul 22, 2026 03:483,85241,643,34730,818,0001,160,0002,113,536
8Jul 22, 2026 03:483,85841,699,73030,977,0001,048,0002,113,536
9Jul 22, 2026 03:483,86246,988,44230,902,0001,159,0002,113,536