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:04Ashish AhujaAshish AhujaScore: 46,097Success
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:0445,593405,636,382378,421,00002,285,568
2Aug 12, 2025 02:0445,624401,987,695376,685,0001,998,0002,285,568
3Aug 12, 2025 02:0445,705408,226,131378,354,0001,000,0002,285,568
4Aug 12, 2025 02:0446,097402,430,598381,605,000998,0002,510,848
5Aug 12, 2025 02:0446,097412,779,718380,604,0001,997,0002,277,376
6Aug 12, 2025 02:0446,105403,751,239381,675,000999,0002,519,040
7Aug 12, 2025 02:0446,106406,204,275380,685,0001,998,0002,273,280
8Aug 12, 2025 02:0446,151410,196,197381,052,0002,000,0002,277,376
9Aug 12, 2025 02:0446,235409,692,674381,752,0001,998,0002,285,568