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 listOct 29, 2025 21:49Anton RazmakhninAnton RazmakhninScore: 225,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 21:49225,0691,896,993,4791,815,102,00052,973,0002,338,816
2Oct 29, 2025 21:49225,0911,891,132,1621,811,281,00056,977,0002,342,912
3Oct 29, 2025 21:49225,1211,899,046,8081,809,551,00058,952,0002,498,560
4Oct 29, 2025 21:49225,1481,896,387,7471,811,766,00056,961,0002,314,240
5Oct 29, 2025 21:49225,1701,897,955,1551,812,948,00055,967,0002,338,816
6Oct 29, 2025 21:49225,2691,897,286,3891,808,772,00060,958,0002,502,656
7Oct 29, 2025 21:49225,3471,892,258,2441,812,399,00057,980,0002,314,240
8Oct 29, 2025 21:49225,5691,893,232,5611,809,251,00062,973,0002,314,240
9Oct 29, 2025 21:49268,8032,254,996,1062,169,094,00061,974,0002,510,848