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 listMay 25, 2025 22:52Abhijit RamanAbhijit RamanScore: 66,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 23:0066,730582,293,037550,859,0002,999,0002,510,848
2May 25, 2025 22:5266,795582,592,074554,400,00002,375,680
3May 25, 2025 22:5266,813580,278,707552,548,0001,998,0002,510,848
4May 25, 2025 22:5266,819579,009,091553,596,000999,0002,510,848
5May 25, 2025 22:5266,819578,477,266552,603,0001,998,0002,498,560
6May 25, 2025 23:0066,822583,825,023553,623,000999,0002,510,848
7May 25, 2025 22:5266,830583,854,111553,693,000999,0002,510,848
8May 25, 2025 23:0066,838585,930,039553,755,000999,0002,510,848
9May 25, 2025 22:5266,839580,744,217552,765,0001,999,0002,379,776
10May 25, 2025 22:5266,843581,373,019552,798,0001,999,0002,510,848
11May 25, 2025 22:5266,845579,675,548553,816,000999,0002,519,040
12May 25, 2025 22:5266,851586,568,511551,861,0002,999,0002,383,872