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 22:17Ashish AhujaAshish AhujaScore: 11,417Success
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 22:1711,176120,499,76070,820,00021,944,0002,469,888
2Aug 22, 2025 22:1711,264120,556,78073,601,00019,892,0002,326,528
3Aug 22, 2025 22:1711,281125,343,67573,714,00019,922,0002,506,752
4Aug 22, 2025 22:1711,417122,195,14778,803,00015,960,0002,510,848
5Aug 22, 2025 22:1711,576123,897,49075,280,00020,801,0002,510,848
6Aug 22, 2025 22:1711,646124,627,46078,725,00017,937,0002,412,544