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 14:05Danylo MocherniukDanylo MocherniukScore: 12,143Success
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 14:0512,128132,090,285100,666,00002,293,760
2Mar 29, 2026 14:0512,139131,217,88898,758,0001,995,0002,293,760
3Mar 29, 2026 14:0512,141127,691,67098,777,0001,995,0002,510,848
4Mar 29, 2026 14:0512,142130,341,90498,784,0001,995,0002,293,760
5Mar 29, 2026 14:0512,143125,377,17498,791,0001,995,0002,506,752
6Mar 29, 2026 14:1712,143131,126,38698,792,0001,995,0002,293,760
7Mar 29, 2026 14:1712,143132,321,85198,793,0001,995,0002,293,760
8Mar 29, 2026 14:1712,144126,927,49198,797,0001,995,0002,285,568
9Mar 29, 2026 14:0512,146126,410,04799,812,000998,0002,293,760
10Mar 29, 2026 14:0512,148127,145,30698,834,0001,996,0002,498,560
11Mar 29, 2026 14:0512,183125,784,27499,133,0001,982,0002,363,392
12Mar 29, 2026 14:0512,231123,317,039100,514,0001,005,0002,506,752