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 listJan 11, 2025 16:47Advait IyerAdvait IyerScore: 83,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 16:4783,637717,970,453693,190,0001,000,0002,277,376
2Jan 11, 2025 16:4783,668720,707,467691,445,0002,997,0002,281,472
3Jan 11, 2025 16:4783,707727,938,904690,773,0003,998,0002,277,376
4Jan 11, 2025 16:4783,729721,152,313692,954,0001,999,0002,277,376
5Jan 11, 2025 16:4783,749718,971,898694,119,0001,000,0002,273,280
6Jan 11, 2025 16:4783,759723,370,277694,200,0001,000,0002,269,184
7Jan 11, 2025 16:4783,798722,856,650694,528,000999,0002,277,376
8Jan 11, 2025 16:4783,816725,362,777693,672,0001,999,0002,277,376
9Jan 11, 2025 16:4783,819725,042,172693,697,0001,999,0002,277,376