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 listDec 22, 2025 04:00Josu San MartinJosu San MartinScore: 38,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 04:0038,631348,125,865318,639,0001,997,0002,379,776
2Dec 22, 2025 04:0038,632344,263,896318,647,0001,997,0002,523,136
3Dec 22, 2025 04:0038,633345,541,973318,657,0001,997,0002,383,872
4Dec 22, 2025 04:0038,637345,398,755318,685,0001,998,0002,260,992
5Dec 22, 2025 04:0038,638354,184,138318,694,0001,998,0002,383,872
6Dec 22, 2025 04:0038,644346,747,098319,747,000999,0002,523,136
7Dec 22, 2025 04:0038,645345,653,542319,754,000999,0002,519,040
8Dec 22, 2025 04:0038,660350,419,265318,883,0001,999,0002,523,136
9Dec 22, 2025 04:0038,663357,276,830319,906,000999,0002,379,776