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 listNov 12, 2024 14:54Kirill AndriianovKirill AndriianovScore: 72,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 14:5472,479623,349,382600,573,000999,0002,482,176
2Nov 12, 2024 14:5472,483623,797,056598,608,0002,998,0002,527,232
3Nov 12, 2024 14:5472,493622,759,940600,695,000999,0002,482,176
4Nov 12, 2024 14:5472,502625,195,574600,770,000999,0002,494,464
5Nov 12, 2024 14:5472,511626,012,392600,840,000999,0002,531,328
6Nov 12, 2024 14:5472,515622,508,326600,877,000999,0002,486,272
7Nov 12, 2024 14:5472,515623,779,709598,873,0002,999,0002,535,424
8Nov 12, 2024 14:5472,519625,590,941599,907,0001,999,0002,535,424
9Nov 12, 2024 14:5472,527623,487,850601,975,00002,527,232