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 28, 2024 23:30TuetuopayTuetuopayScore: 64,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 23:3064,083595,624,858531,886,33602,232,320
2Jul 28, 2024 23:3064,083593,994,605531,885,66202,359,296
3Jul 28, 2024 23:3064,092606,063,219531,966,28702,228,224