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 listFeb 12, 2025 21:35Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 75,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 21:3575,509649,947,512624,722,0001,999,0002,273,280
2Feb 12, 2025 21:3575,511652,721,647624,745,0001,999,0002,289,664
3Feb 12, 2025 21:3575,518648,926,155625,798,000999,0002,265,088
4Feb 12, 2025 21:3575,524652,892,984624,850,0001,999,0002,273,280
5Feb 12, 2025 21:3575,528651,402,601624,885,0001,999,0002,273,280
6Feb 12, 2025 21:3575,530649,682,260624,900,0001,999,0002,273,280
7Feb 12, 2025 21:3575,536647,879,698624,946,0001,999,0002,289,664
8Feb 12, 2025 21:3575,539652,061,069624,976,0001,999,0002,293,760
9Feb 12, 2025 21:3575,541655,272,016624,995,0001,999,0002,289,664