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 listDec 5, 2025 06:58Rajarshi BasuRajarshi BasuScore: 844,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 06:58840,5467,008,457,0756,974,534,0001,999,0002,486,272
2Dec 5, 2025 06:58844,8797,042,306,6767,011,497,000999,0002,281,472
3Dec 5, 2025 06:58848,7587,073,543,3587,039,698,0004,996,0002,281,472