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 listAug 21, 2025 05:04t19783199t19783199Score: 1,877,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 05:041,877,65015,612,690,51615,510,534,00073,964,0002,277,376
2Aug 21, 2025 05:041,877,91815,628,125,98815,525,761,00060,959,0002,285,568
3Aug 21, 2025 05:042,018,41316,791,482,81416,697,850,00054,976,0002,277,376