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 06:39Ashish AhujaAshish AhujaScore: 11,461Success
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 06:3911,099120,204,10470,327,00021,791,0002,367,488
2Aug 26, 2025 06:3911,286118,930,90877,729,00015,944,0002,494,464
3Aug 26, 2025 06:3911,358119,601,12976,410,00017,862,0002,510,848
4Aug 26, 2025 06:3911,461125,832,56875,310,00019,818,0002,494,464
5Aug 26, 2025 06:3911,478127,010,83372,445,00022,825,0002,494,464
6Aug 26, 2025 06:3912,111132,988,60682,609,00017,915,0002,318,336