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:35Ashish AhujaAshish AhujaScore: 11,471Success
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 06:3511,132121,580,00672,524,00019,869,0002,301,952
2Aug 26, 2025 06:3511,376125,608,89072,557,00021,866,0002,318,336
3Aug 26, 2025 06:3511,404124,275,52772,732,00021,919,0002,482,176
4Aug 26, 2025 06:3511,471125,055,69574,381,00020,826,0002,367,488
5Aug 26, 2025 06:3511,492127,193,85976,508,00018,878,0002,490,368
6Aug 26, 2025 06:3512,330129,675,95680,482,00021,859,0002,465,792