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 20, 2023 20:58Jean-Francois SMIGIELSKIJean-Francois SMIGIELSKIScore: 43,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2023 20:5443,434416,507,093360,504,04302,269,184
2Jul 20, 2023 20:5443,450437,077,644360,635,58402,260,992
3Jul 20, 2023 20:5843,468422,045,676360,787,41202,269,184
4Jul 20, 2023 20:5243,477404,700,132360,862,45502,252,800
5Jul 20, 2023 20:5243,489423,638,292360,959,94002,269,184
6Jul 20, 2023 20:5843,501432,790,074361,056,90102,260,992
7Jul 20, 2023 20:5443,511413,404,885361,143,11202,277,376
8Jul 20, 2023 20:5243,515436,882,284361,173,39302,269,184
9Jul 20, 2023 20:5843,526401,875,722361,263,39502,277,376