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:28Alexander KovalyovAlexander KovalyovScore: 2,066,016Success
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:282,064,86817,169,103,75417,077,438,00060,969,0002,277,376
2Oct 29, 2025 21:282,065,21617,176,313,78317,083,321,00057,970,0002,265,088
3Oct 29, 2025 21:282,065,23517,173,360,24717,083,479,00057,974,0002,277,376
4Oct 29, 2025 21:282,065,69117,181,695,39917,064,281,00080,958,0002,277,376
5Oct 29, 2025 21:282,066,01617,188,127,90517,071,968,00075,964,0002,277,376
6Oct 29, 2025 21:282,066,54117,182,321,00417,086,319,00065,970,0002,277,376
7Oct 29, 2025 21:282,069,18817,210,486,73017,118,290,00055,971,0002,277,376
8Oct 29, 2025 21:282,073,64717,242,662,99017,140,304,00070,963,0002,277,376
9Oct 29, 2025 21:282,088,02917,367,617,46617,274,666,00055,972,0002,277,376