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 listDec 19, 2025 19:51Zhalgas KhassenovZhalgas KhassenovScore: 1,660,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:511,657,21413,788,705,26913,646,942,000107,936,0002,330,624
2Dec 19, 2025 19:511,657,85713,799,418,72413,650,284,000109,929,0002,338,816
3Dec 19, 2025 19:511,658,27813,799,857,99613,649,786,000113,923,0002,334,720
4Dec 19, 2025 19:511,660,50113,817,942,65513,665,233,000116,924,0002,338,816
5Dec 19, 2025 19:511,660,91713,818,378,93613,652,716,000132,899,0002,347,008
6Dec 19, 2025 19:511,663,44413,848,043,71313,701,654,000104,928,0002,441,216
7Dec 19, 2025 19:511,674,82613,931,863,99613,789,127,000111,927,0002,502,656
8Dec 19, 2025 19:511,682,72814,007,148,83213,849,732,000116,913,0002,347,008
9Dec 19, 2025 19:511,696,96014,121,045,02213,985,835,00098,935,0002,355,200