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 29, 2026 13:45Danylo MocherniukDanylo MocherniukScore: 13,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:4512,914129,348,543105,183,0002,003,0002,355,200
2Mar 29, 2026 13:4512,928128,443,660107,305,00002,293,760
3Mar 29, 2026 13:4512,966136,342,844105,627,0001,992,0002,289,664
4Mar 29, 2026 13:4513,049133,821,958106,302,0002,005,0002,494,464
5Mar 29, 2026 13:4513,226136,933,798109,779,00002,293,760
6Mar 29, 2026 13:4513,240132,372,246107,892,0001,998,0002,510,848
7Mar 29, 2026 13:4513,256141,624,604108,025,0002,000,0002,293,760
8Mar 29, 2026 13:4513,258137,083,074108,039,0002,000,0002,293,760
9Mar 29, 2026 13:4513,292139,147,326108,322,0002,005,0002,293,760