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 13:48Ashish AhujaAshish AhujaScore: 11,208Success
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 13:4810,860121,125,07868,347,00021,791,0002,453,504
2Aug 26, 2025 13:4811,158119,311,90573,693,00018,921,0002,301,952
3Aug 26, 2025 13:4811,197119,820,07068,950,00023,982,0002,510,848
4Aug 26, 2025 13:4811,208122,162,72272,022,00021,006,0002,289,664
5Aug 26, 2025 13:4811,225123,245,00375,330,00017,841,0002,457,600
6Aug 26, 2025 13:4811,342121,652,85876,300,00017,836,0002,379,776