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 4, 2023 23:55sliceteamsliceteamScore: 1,640,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2023 22:391,624,73013,552,118,43013,485,259,83902,256,896
2Mar 12, 2023 22:381,640,36713,683,736,13713,615,046,44102,244,608
3Mar 12, 2023 22:391,640,55913,681,468,82113,616,637,91602,252,800
4Mar 12, 2023 22:381,640,76113,683,321,64813,618,316,40702,260,992
5Jul 4, 2023 23:551,640,95013,682,679,93013,619,885,03602,256,896
6Jul 4, 2023 23:551,641,68813,696,528,52113,626,009,26202,256,896
7Mar 12, 2023 22:381,641,85613,683,866,79213,627,405,41502,256,896
8Jul 4, 2023 23:551,642,87513,699,810,79413,635,859,04302,256,896
9Mar 12, 2023 22:391,643,72213,714,723,29413,642,889,69302,252,800