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 22, 2025 21:28Ashish AhujaAshish AhujaScore: 11,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 21:2811,696125,609,00579,244,00017,829,0002,506,752
2Aug 22, 2025 21:2811,822125,916,53678,301,00019,823,0002,424,832
3Aug 22, 2025 21:2811,842125,448,75278,434,00019,856,0002,506,752
4Aug 22, 2025 21:2811,950125,920,16980,342,00018,845,0002,482,176
5Aug 22, 2025 21:2812,124130,024,88678,708,00021,918,0002,473,984
6Aug 22, 2025 21:2812,669133,086,69289,279,00015,871,0002,506,752