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 listDec 28, 2023 04:17Harsh SinhaHarsh SinhaScore: 1,637,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2023 04:171,634,90213,629,725,71413,569,683,47602,252,800
2Dec 28, 2023 04:171,637,68313,664,359,86113,592,770,27102,252,800
3Dec 28, 2023 04:171,639,88713,688,064,54613,611,062,35002,256,896