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 9, 2021 10:14Prisyazhnyuk AlexanderPrisyazhnyuk AlexanderScore: 93,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2021 09:1393,212838,246,841773,660,70602,228,224
2Jul 8, 2021 22:1993,238826,454,871773,876,79002,228,224
3Jul 8, 2021 22:1993,256831,473,548774,028,09102,215,936
4Jul 9, 2021 09:1393,268838,788,106774,126,61402,215,936
5Jul 8, 2021 22:1993,269832,915,685774,133,41502,215,936
6Jul 9, 2021 09:1393,270839,553,827774,139,64902,215,936
7Jul 9, 2021 10:1493,287836,637,953774,282,07602,224,128
8Jul 9, 2021 10:1493,295828,473,216774,347,77302,220,032
9Jul 9, 2021 10:1493,433836,502,745775,492,89902,224,128