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 listAug 22, 2025 14:44Gjorgji KjosevGjorgji KjosevScore: 82,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 14:4482,490709,470,483618,700,00065,968,0002,359,296
2Aug 22, 2025 14:4482,631709,411,767609,855,00075,982,0002,281,472
3Aug 22, 2025 14:4482,711716,350,369621,547,00064,952,0002,355,200
4Aug 22, 2025 14:4482,764714,268,231620,949,00065,994,0002,355,200
5Aug 22, 2025 14:4482,773709,739,960618,011,00069,001,0002,285,568
6Aug 22, 2025 14:4482,810717,165,943616,289,00071,033,0002,285,568
7Aug 22, 2025 14:4482,843713,425,241613,643,00073,957,0002,285,568
8Aug 22, 2025 14:4482,880712,406,019618,917,00068,990,0002,347,008
9Aug 22, 2025 14:4482,909716,942,493611,131,00077,016,0002,289,664