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 07:56Ashish AhujaAshish AhujaScore: 16,939Success
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:5316,770166,223,645124,275,00014,913,0002,404,352
2Aug 26, 2025 07:5316,776171,016,222119,346,00019,891,0002,502,656
3Aug 26, 2025 07:5616,867171,304,274122,126,00017,872,0002,453,504
4Aug 26, 2025 07:5616,939169,377,996121,646,00018,944,0002,281,472
5Aug 26, 2025 07:5617,057163,050,855122,632,00018,943,0002,494,464
6Aug 26, 2025 07:5317,275164,282,876126,454,00016,927,0002,396,160