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 26, 2025 06:58Ashish AhujaAshish AhujaScore: 15,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 07:0115,666158,888,474111,172,00018,859,0002,506,752
2Aug 26, 2025 07:0115,703154,677,150115,415,00014,924,0002,490,368
3Aug 26, 2025 07:0115,708159,930,159112,601,00017,779,0002,453,504
4Aug 26, 2025 06:5815,894160,703,125115,928,00015,990,0002,433,024
5Aug 26, 2025 06:5816,160159,416,682115,250,00018,877,0002,502,656
6Aug 26, 2025 06:5816,646172,058,760120,268,00017,891,0002,510,848