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 listOct 15, 2024 15:57Elnur RakhmatullinElnur RakhmatullinScore: 64,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 15:5764,404564,772,512459,614,00074,937,0002,363,392
2Oct 15, 2024 15:5764,405561,732,728458,625,00075,937,0002,363,392
3Oct 15, 2024 15:5764,406559,619,521459,628,00074,939,0002,363,392
4Oct 15, 2024 15:5764,425566,912,030453,766,00080,958,0002,359,296
5Oct 15, 2024 15:5764,485563,546,216454,342,00080,882,0002,363,392
6Oct 15, 2024 15:5764,495561,784,557456,413,00078,898,0002,400,256
7Oct 15, 2024 15:5764,619564,586,590450,447,00085,894,0002,277,376
8Oct 15, 2024 15:5764,670564,961,293462,792,00073,966,0002,465,792
9Oct 15, 2024 15:5764,685567,405,410455,901,00080,982,0002,285,568