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 listFeb 15, 2025 10:19Roman LytkinRoman LytkinScore: 372,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2021 17:35371,0413,137,586,0263,079,638,29002,252,800
2Nov 24, 2021 17:35371,0873,151,707,7573,080,020,13402,265,088
3Nov 24, 2021 17:35372,7783,147,174,2953,094,060,70502,289,664
4Feb 15, 2025 10:19372,9133,125,313,3253,001,231,00093,944,0002,281,472
5Feb 15, 2025 10:19373,0193,122,717,1872,988,126,000107,932,0002,387,968
6Feb 15, 2025 10:19374,0653,140,158,0023,011,804,00092,932,0002,281,472