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 18, 2025 13:07Ashish AhujaAshish AhujaScore: 10,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0710,842113,361,29783,989,0005,999,0002,473,984
2Aug 18, 2025 13:0710,926114,656,29984,710,0005,979,0002,535,424
3Aug 18, 2025 13:0710,948117,048,40085,878,0004,992,0002,277,376
4Aug 18, 2025 13:0710,998120,369,01584,265,0007,022,0002,281,472
5Aug 18, 2025 13:0711,029122,525,63485,570,0005,970,0002,285,568
6Aug 18, 2025 13:0711,210118,883,83286,038,0007,003,0002,392,064