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 listMay 25, 2022 09:36Keichi TakahashiKeichi TakahashiScore: 1,641,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2022 09:361,641,17013,696,101,61313,621,707,87702,252,800
2May 25, 2022 09:361,641,33013,689,582,98413,623,037,01902,248,704
3May 25, 2022 09:361,641,94813,685,620,79113,628,166,28102,252,800