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 19, 2025 06:27Ashish AhujaAshish AhujaScore: 10,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 06:2710,394112,596,61479,246,0007,021,0002,289,664
2Aug 19, 2025 06:2710,489110,932,78080,056,0007,004,0002,347,008
3Aug 19, 2025 06:2710,502112,830,16080,156,0007,013,0002,359,296
4Aug 19, 2025 06:2710,557113,460,43480,654,0006,970,0002,387,968
5Aug 19, 2025 06:2710,582113,933,81181,845,0005,988,0002,519,040
6Aug 19, 2025 06:2710,635112,609,55483,257,0005,015,0002,289,664