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 18, 2024 12:46Andrey LikhachevAndrey LikhachevScore: 12,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2024 12:4612,061125,889,39598,103,0002,002,0002,363,392
2Jul 18, 2024 12:4612,077121,706,81998,237,0002,004,0002,367,488
3Jul 18, 2024 12:4612,083125,740,72699,286,0001,002,0002,285,568
4Jul 18, 2024 12:4612,089128,729,17699,333,0001,003,0002,363,392
5Jul 18, 2024 12:4612,091122,080,15099,353,0001,003,0002,359,296
6Jul 18, 2024 12:4612,096121,507,89699,392,0001,003,0002,285,568
7Jul 18, 2024 12:4612,097125,727,65299,402,0001,004,0002,285,568
8Jul 18, 2024 12:4612,112131,251,657100,529,00002,367,488
9Jul 18, 2024 12:4612,132128,252,38098,704,0001,994,0002,367,488
10Jul 18, 2024 12:4612,893177,613,525107,008,63402,236,416
11Jul 18, 2024 12:4612,902189,127,435107,085,68702,232,320
12Jul 18, 2024 12:4612,908188,018,855107,139,93202,228,224