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 6, 2025 15:17Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 401,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 22:31400,8383,388,372,1703,326,957,37202,203,648
2Jul 29, 2024 22:31401,1513,386,189,0303,329,554,62302,195,456
3Jul 29, 2024 22:31401,5203,394,478,0883,332,616,44702,199,552
4Jul 6, 2025 15:17401,7743,366,848,0123,272,771,00061,957,0002,285,568
5Jul 6, 2025 15:17401,8663,363,742,3973,262,519,00072,966,0002,281,472
6Jul 6, 2025 15:17401,9203,366,434,5043,279,955,00055,982,0002,285,568
7Jul 6, 2025 15:17402,2023,366,885,6793,286,307,00051,973,0002,371,584
8Jul 6, 2025 15:17402,2943,371,768,6663,280,072,00058,965,0002,285,568
9Jul 6, 2025 15:17402,3363,364,556,9483,279,419,00059,971,0002,285,568