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 16, 2024 18:43zielajzielajScore: 3,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 18:433,77353,310,92030,309,0001,010,0002,527,232
2Nov 16, 2024 18:433,77959,178,36831,365,00002,347,008
3Nov 16, 2024 18:433,81063,330,51831,626,00002,347,008
4Nov 16, 2024 18:433,90054,155,65131,359,0001,011,0002,355,200
5Nov 16, 2024 18:433,90758,054,34532,429,00002,277,376
6Nov 16, 2024 18:433,92353,416,90432,561,00002,269,184