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 listSep 5, 2024 10:45Matthew BookerMatthew BookerScore: 1,826,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2024 10:451,826,22715,191,777,14415,087,726,00069,957,0002,285,568
2Sep 5, 2024 10:451,826,65215,190,085,70115,103,238,00057,977,0002,281,472
3Sep 5, 2024 10:451,827,25115,197,676,60215,091,210,00074,971,0002,281,472