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 listJan 11, 2023 18:32Kevin HeaveyKevin HeaveyScore: 57,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2023 18:3257,259547,142,233475,252,95202,215,936
2Jan 11, 2023 18:3157,282543,087,776475,444,30102,224,128
3Jan 11, 2023 18:3457,294543,595,649475,537,45302,220,032
4Jan 11, 2023 18:3457,295543,719,259475,551,63402,232,320
5Jan 11, 2023 18:3157,299556,235,426475,581,76102,224,128
6Jan 11, 2023 18:3257,301542,816,051475,601,25202,220,032
7Jan 11, 2023 18:3457,305547,832,316475,631,90702,224,128
8Jan 11, 2023 18:3157,307533,676,314475,650,71002,220,032
9Jan 11, 2023 18:3257,307544,911,554475,650,83902,224,128