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 19, 2024 03:06zielajzielajScore: 3,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 03:063,51549,190,24027,162,0002,012,0002,383,872
2Nov 19, 2024 03:063,52150,353,70928,218,0001,007,0002,379,776
3Nov 19, 2024 03:063,52458,736,64727,232,0002,017,0002,523,136
4Nov 19, 2024 03:063,66149,439,13429,371,0001,012,0002,396,160
5Nov 19, 2024 03:063,68656,486,16429,575,0001,019,0002,396,160
6Nov 19, 2024 03:063,68861,161,12329,591,0001,020,0002,527,232