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 12, 2025 02:03Ashish AhujaAshish AhujaScore: 47,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 02:0347,383418,330,986393,282,00002,506,752
2Aug 12, 2025 02:0347,385415,743,765392,294,0001,000,0002,510,848
3Aug 12, 2025 02:0347,443417,226,728391,776,0001,998,0002,367,488
4Aug 12, 2025 02:0347,445419,747,492391,795,0001,998,0002,510,848
5Aug 12, 2025 02:0347,464421,263,567391,951,0001,999,0002,277,376
6Aug 12, 2025 02:0347,651417,538,467393,503,0001,997,0002,510,848
7Aug 12, 2025 02:0347,967424,389,619396,127,0002,000,0002,510,848
8Aug 12, 2025 02:0347,979418,606,477397,223,0001,000,0002,367,488
9Aug 12, 2025 02:0348,049422,901,907395,810,0002,998,0002,285,568