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 24, 2025 17:57imbr92imbr92Score: 393,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 17:57392,5043,282,101,8913,199,808,00057,978,0002,506,752
2Jul 24, 2025 17:57393,3063,289,219,7633,201,474,00062,969,0002,281,472
3Jul 24, 2025 17:57393,3923,296,901,5113,200,190,00064,963,0002,281,472
4Jul 24, 2025 17:57393,3963,298,149,2203,199,221,00065,963,0002,281,472
5Jul 24, 2025 17:57393,5193,294,266,1023,194,248,00071,960,0002,281,472
6Jul 24, 2025 17:57396,0113,314,930,1943,223,914,00062,978,0002,289,664
7Jul 24, 2025 17:57396,7473,320,555,2673,218,050,00074,954,0002,506,752
8Jul 24, 2025 17:57396,8963,316,443,4063,236,267,00057,968,0002,281,472
9Jul 24, 2025 17:57405,2043,400,756,5253,291,235,00071,961,0002,510,848