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 5, 2021 16:30Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 16:3100000Error: expected "53690359513895061 ", got "53690359511336061 "
2Jul 5, 2021 16:3200000Error: expected "53692501201417120 ", got "53692500945517120 "
3Jul 5, 2021 16:3200000Error: expected "53689660944229887 ", got "53689660688329887 "
4Jul 5, 2021 16:3300000Error: expected "53681148942278212 ", got "53681148942252612 "
5Jul 5, 2021 16:3035,476350,611,595294,454,57902,220,032
6Jul 5, 2021 16:3035,488354,077,986294,553,16102,228,224
7Jul 5, 2021 16:3035,497386,054,223294,625,41902,211,840