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 20, 2024 01:53zielajzielajScore: 3,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 01:533,53250,445,51628,308,0001,011,0002,523,136
2Nov 20, 2024 01:533,53557,460,78429,343,00002,527,232
3Nov 20, 2024 01:533,55448,388,77128,481,0001,017,0002,527,232
4Nov 20, 2024 01:533,67355,599,32929,467,0001,016,0002,277,376
5Nov 20, 2024 01:533,73452,123,86328,997,0001,999,0002,400,256
6Nov 20, 2024 01:533,73856,960,70229,026,0002,001,0002,392,064